Novel Metric Conditional Shortest Path Routing in Delay Tolerant in Wireless Mobile Ad-hoc Networks

Routing in delay tolerant networks (DTN) is a challenging problem because at any given time instance, the probability that there is an end-to-end path from a source to a destination. Opportunistic delay tolerant networks are organized by the sporadic connectivity between their nodes and the lack of stable paths from sender to receiver. Future connections are mostly unknown in these networks sending used to deliver the messages with effective forwarding data i.e., average intermeeting time between nodes to avoid risks or intrusion, attacks. Our proposed system analysis the novel metric conditional intermeeting average time computes duration of time between two nodes relative to meet the third node only local knowledge of past contacts. In this work we survey the routing protocols in wireless sensor networks, applications of MANETs and compares the metric based algorithms for delay tolerant networks is existing one. Keywords– Wireless Sensor Networks, MANETs, Routing and Delay Tolerant Networks